控制爆破法处理卡钻事故

介绍了在包头市某工程实施管道穿越黄河施工中,采用爆破法处理卡钻的经验。针对深水环境条件及钻杆内径小不宜采用集团装药的条件,确定采用"小直径爆破筒,钻杆内部装药"的爆破方案,阐述了爆破设计及施工注意事项。可供类似工程参考。     

智能数据分区与布局研究

大数据时代,数据规模庞大,由数据进行驱动的应用分析场景日益增多.如何快速、高效地从这些海量数据中提取出用以分析决策的信息,给数据库系统带来重大挑战.同时,现代商业分析决策对分析数据的实时性要求数据库系统能够同时快速处理ACID事务和复杂的分析查询.然而,传统的数据分区粒度太粗,且不能适应动态变化的复杂分析负载;传统的数据布局单一,不能应对现代大量增加的混合事务分析应用场景.为了解决以上问题,“智能数据分区与布局”成为当前的研究热点之一,它通过数据挖掘、机器学习等技术抽取工作负载的有效特征,设计最佳的分区策略来避免扫描大量不相关的数据,指导布局结构设计以适应不同类型的工作负载.首先介绍了智能数据分区与布局的相关背景知识,然后对智能数据分区与布局技术的研究动机、发展趋势、关键技术进行详细的阐述.最后,对智能数据分区与布局技术的研究前景做出总结与展望.     

粮仓环境监测系统设计

随着科学技术的发展,粮食行业信息化发展得到了强有力的科技支撑。为满足粮库整体信息化建设的要求,打破"信息孤岛"现状,实现资源整合、数据共享,为大数据分析和数据应用提供数据基础,设计一款能够实时采集粮仓内温湿度、氧气、二氧化碳气体浓度、粮堆高度的数据集成系统。系统采用分层分布式结构,由数据集中器和多种传感器模块组成,数据集中器与各传感器模块间通过RS485总线进行数据通讯,并由数据集中器通过网络专线传输汇总的环境监测数据,通过专用软件进行数据处理和挖掘,从而实现粮仓环境监测和预警等功能。     

基于大数据的智慧林业系统设计

With the development of 5G, big data, cloud computing, IOT, mobile Internet and other information technologies of new generation, the design of forestry information system establishes a new mode of forestry development integrating three-dimensional perception, collaborative management and internal and external services by means of perception, IOT and intelligence. Intelligent forestry system is a comprehensive information management system integrating forest management, intelligent forestry business management, green maintenance management and emergency command and dispatching management. Based on the specific project practice, this paper puts forward the overall framework design scheme and management platform design scheme of intelligent forest- ry.     

Study and comparison of the unique selling propositions (USPs) of free-to-use multinational patent search systems

The article analyses and compares some free-to-use patent search services which are not managed by patent authorities but which may offer unique selling propositions (USPs) beyond the expected, standard, search functions. Those services selected for this study are Google Patents, Lens, Patent Inspiration, Free Patents Online, SureChEMBL and Octimine. For this comparative study a total set of 66 criteria were analysed for each of the six search services. Furthermore the USPs and perceived advantages and disadvantages were identified. The study concluded that some of these search services are better suited for general prior art searches or patent analysis while others are applicable for patent searches in specific fields like biotechnology or pharmaceuticals.     

基于Fusion Compute虚拟化平台的HIRFL数据库迁移及性能优化

为解决兰州重离子加速器（HIRFL）数据中心资源利用率低下、硬件和维护成本较高等问题，HIRFL数据中心正在向虚拟化集群模式进行迁移。本文以华为Fusion Compute虚拟化平台为基础，构建了HIRFL数据库的迁移方案。通过物理主机、虚拟机计算资源、内存、存储和网络资源性能优化，提出了1套完整的HIRFL数据库虚拟机性能优化方案。采用业界主流的数据库性能测试工具Benchmark Factory对迁移前后的数据库进行了测试，对比实验表明，本文提出的方案具有有效性和可行性，降低了数据中心的运行和维护成本，提升了HIRFL数据库系统的安全性和稳定性。     

基于物联网的重离子加速器状态诊断系统研究与设计

为更好地保障中国科学院近代物理研究所重离子加速器（HIRFL）的稳定运行，本文研究设计了基于物联网的状态诊断系统。针对HIRFL中设备数量庞大、种类复杂的特点，采用物联网的设计架构，利用各种传感器进行数据采集，并通过网络传输给中央控制系统中的数据库，由服务器中运行的控制软件对这些数据进行综合分析，给出合理的建议并发出相应的指令。根据HIRFL的实际情况，初步设计了1个HIRFL状态诊断系统模型，包括底层的硬件设计和上层的软件设计以及界面设计。部分控制界面已上线运行，并在实际运行中得到了检验，取得了一定的加速器状态诊断效果。     

On the Codd semantics of SQL nulls

Theoretical models used in database research often have subtle differences with those occurring in practice. One particular mismatch that is usually neglected concerns the use of marked nulls to represent missing values in theoretical models of incompleteness, while in an SQL database these are all denoted by the same syntactic

object. It is commonly argued that results obtained in the model with marked nulls carry over to SQL, because SQL nulls can be interpreted as Codd nulls, which are simply marked nulls that do not repeat. This argument, however, does not take into account that even simple queries may produce answers where distinct occurrences of

do in fact denote the same unknown value. For such queries, interpreting SQL nulls as Codd nulls would incorrectly change the semantics of query answers. To use results about Codd nulls for real-life SQL queries, we need to understand which queries preserve the Codd interpretation of SQL nulls. We show, however, that the class of relational algebra queries preserving Codd interpretation is not recursively enumerable, which necessitates looking for sufficient conditions for such preservation. Those can be obtained by exploiting the information provided by NOT NULL constraints on the database schema. We devise mild syntactic restrictions on queries that guarantee preservation, do not limit the full expressiveness of queries on databases without nulls, and can be checked efficiently.     

A time-aware searchable encryption scheme for EHRs

Despite the benefits of EHRs (Electronic Health Records), there is a growing concern over the risks of privacy exposure associated with the technologies of EHR storing and transmission. To deal with this problem, a time-aware searchable encryption with designated server is proposed in this paper. It is based on Boneh's public key encryption with keyword search and Rivest's timed-release cryptology. Our construction has three features: the user cannot issue a keyword search query successfully unless the search falls into the specific time range; only the authorized user can generate a valid trapdoor; only the designated server can execute the search. Applying our scheme in a multi-user environment, the number of the keyword ciphertexts would not increase linearly with the number of the authorized users. The security and performance analysis shows that our proposed scheme is securer and more efficient than the existing similar schemes.